Search results for "Quantum world"

showing 3 items of 3 documents

Worst Case Analysis of Non-local Games

2013

Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an input x i to the i th player who then responds by sending an answer a i to the referee. The players win if the answers a i satisfy a condition that may depend on the inputs x i .

Computer Science::Computer Science and Game TheoryComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERAL0102 computer and information sciencesNon local01 natural sciences010201 computation theory & mathematicsQuantum stateSimple (abstract algebra)0103 physical sciencesQuantum worldQuantum information010306 general physicsMathematical economicsCase analysisMathematics
researchProduct

Nonlocal Quantum XOR Games for Large Number of Players

2010

Nonlocal games are used to display differences between classical and quantum world In this paper, we study nonlocal games with a large number of players We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player, a subclass of nonlocal games We illustrate those methods on the example of the N-player game (due to Ardehali [Ard92]) that provides the maximum quantum-over-classical advantage.

CombinatoricsAlgebraComputer Science::Computer Science and Game TheoryQuantum pseudo-telepathySimple (abstract algebra)TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALQuantum worldQuantumMathematics
researchProduct

On symmetric nonlocal games

2013

Abstract Nonlocal games are used to display differences between the classical and quantum world. In this paper, we study symmetric XOR games, which form an important subset of nonlocal games. We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player. We illustrate those methods with two examples. One example is an N -player game (due to Ardehali (1992) [3] ) that provides the maximum quantum-over-classical advantage. The second example comes from generalization of CHSH game by letting the referee to choose arbitrary symmetric distribution of players’ inputs.

Discrete mathematicsComputer Science::Computer Science and Game TheoryGeneral Computer ScienceQuantum pseudo-telepathyGeneralizationSymmetric gameComputingMilieux_PERSONALCOMPUTINGCombinatorial game theoryTheoryofComputation_GENERALSymmetric probability distributionTheoretical Computer ScienceSimple (abstract algebra)Quantum worldMathematical economicsQuantumMathematicsTheoretical Computer Science
researchProduct